The number of spanning trees of a complete multipartite graph
نویسندگان
چکیده
منابع مشابه
On relation between the Kirchhoff index and number of spanning trees of graph
Let $G=(V,E)$, $V={1,2,ldots,n}$, $E={e_1,e_2,ldots,e_m}$,be a simple connected graph, with sequence of vertex degrees$Delta =d_1geq d_2geqcdotsgeq d_n=delta >0$ and Laplacian eigenvalues$mu_1geq mu_2geqcdotsgeqmu_{n-1}>mu_n=0$. Denote by $Kf(G)=nsum_{i=1}^{n-1}frac{1}{mu_i}$ and $t=t(G)=frac 1n prod_{i=1}^{n-1} mu_i$ the Kirchhoff index and number of spanning tree...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملThe Number of Spanning Trees in Generalized Complete Multipartite Graphs of Fan-Type
Let Kk,n be a complete k-partite graph of order n and let K k,n be a generalized complete k-partite graph of order n spanned by the fan set F = {Fn1 , Fn2 , · · · , Fnk}, where n = {n1, n2, · · · , nk} and n = n1 + n2 + · · ·+ nk for 1 6 k 6 n. In this paper, we get the number of spanning trees in Kk,n to be t(Kk,n) = n k−2 k ∏ i=1 (n− ni)i. and the number of spanning trees in K k,n to be t(K k...
متن کاملThe interval number of a complete multipartite graph
The interval number of a graph G, denoted i(G), is the least positive integer t for which G is the intersection graph of a family of sets each of which is the union of at most t cIosed intervals of the real line IR. Trotter and Harary showed that the interval number of the complete bipartite graph K(m, n) is [(mn + I)/(m + n)]. Matthews showed that the interval number of the complete multiparti...
متن کاملEncoding Spanning Trees of Complete Multipartite Graphs Quickly
Deo and Micikevicius recently gave a new bijection for spanning trees of complete bipartite graphs. Their method had advantages of linear running time for encoding and decoding, as well as for computing the diameter, center and radius directly from the encoding without having to construct the tree. In this paper we devise a generalization of Deo and Micikevicius’s method, which also a modificat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)90111-5